Scaling limits of branching random walks and branching-stable processes
نویسندگان
چکیده
Abstract Branching-stable processes have recently appeared as counterparts of stable subordinators, when addition real variables is replaced by branching mechanisms for point processes. Here we are interested in their domains attraction and describe explicit conditions a random walk to converge after proper magnification branching-stable process. This contrasts with deep results obtained during the past decade on asymptotic behavior walks which involve either shifting without rescaling, or demagnification.
منابع مشابه
Branching Random Walks
We study a generalized branching random walk where particles breed at a rate which depends on the number of neighbouring particles. Under general assumptions on the breeding rates we prove the existence of a phase where the population survives without exploding. We construct a non trivial invariant measure for this case.
متن کاملMaxima of Branching Random Walks
In recent years several authors have obtained limit theorems for Ln, the location of the rightmost particle in a supercritical branching random walk but all of these results have been proved under the assumption that the offspring distribution has (p(O)=.fexp(Ox)dF(x)0. In this paper we investigate what happens when there is a slowly varying function K so that 1-F(x)~x-qK(x) as x...
متن کاملBranching random walks and contact processes on Galton-Watson trees
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is a Galton-Watson tree then, in certain circumstances, the branching random walks and contact processes will have weak survival phases. We also provide bounds...
متن کاملBranching Random Walks on Graphs
We study a new distributed randomized information propagation mechanism in networks that we call a branching random walk (BRW). BRW is a generalization of the well-studied “standard” random walk which is a fundamental primitive useful in a wide variety of network applications ranging from token management and load balancing to search, routing, information propagation and gossip. BRW is paramete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2022
ISSN: ['1475-6072', '0021-9002']
DOI: https://doi.org/10.1017/jpr.2021.101